0.00/0.05 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 180 THM 0.16/0.43 % Computer : n013.cluster.edu 0.16/0.43 % Model : x86_64 x86_64 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.16/0.43 % Memory : 8046.5625MB 0.16/0.43 % OS : Linux 6.8.0-71-generic 0.16/0.43 % CPULimit : 1440 0.16/0.43 % WCLimit : 180 0.16/0.43 % DateTime : Mon Jul 27 12:14:08 UTC 2026 0.16/0.43 % CPUTime : 0.16/0.43 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 180 THM 0.16/0.50 Running higher-order theorem proving 0.46/0.79 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.bWZqYebA91/E---3.1_1425355.p 3.21/1.53 % Version: 3.5.1-ho 3.21/1.53 % Preprocessing class: HMLSSMSMSSSNSFA. 3.21/1.53 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 3.21/1.53 % Starting sh3 with 900s (5) cores 3.21/1.53 % Starting lpo1_def_fix with 180s (1) cores 3.21/1.53 % Starting lpo8_s with 180s (1) cores 3.21/1.53 % Starting lpo1_lambda_fix with 180s (1) cores 3.21/1.53 % sh3 with pid 1425368 completed with status 0 3.21/1.53 % Result found by sh3 3.21/1.53 % Preprocessing class: HMLSSMSMSSSNSFA. 3.21/1.53 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 3.21/1.53 % Starting sh3 with 900s (5) cores 3.21/1.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto) 3.21/1.53 % No SInE strategy applied 3.21/1.53 % Search class: HGHSM-SSLM32-DSFFFFBN 3.21/1.53 % Scheduled 6 strats onto 5 cores with 900 seconds (900 total) 3.21/1.53 % Starting SubtermCWHack with 91s (1) cores 3.21/1.53 % Starting sh3 with 450s (1) cores 3.21/1.53 % Starting lpo1_def_fix with 113s (1) cores 3.21/1.53 % Starting lpo8_s with 113s (1) cores 3.21/1.53 % Starting lpo1_lambda_fix with 113s (1) cores 3.21/1.53 % sh3 with pid 1425376 completed with status 0 3.21/1.53 % Result found by sh3 3.21/1.53 % Preprocessing class: HMLSSMSMSSSNSFA. 3.21/1.53 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 3.21/1.53 % Starting sh3 with 900s (5) cores 3.21/1.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto) 3.21/1.53 % No SInE strategy applied 3.21/1.53 % Search class: HGHSM-SSLM32-DSFFFFBN 3.21/1.53 % Scheduled 6 strats onto 5 cores with 900 seconds (900 total) 3.21/1.53 % Starting SubtermCWHack with 91s (1) cores 3.21/1.53 % Starting sh3 with 450s (1) cores 3.21/1.53 % Preprocessing time : 0.038 s 3.21/1.53 % Presaturation interreduction done 3.21/1.53 3.21/1.53 % Proof found! 3.21/1.53 % SZS status Theorem 3.21/1.53 % SZS output start CNFRefutation 3.21/1.53 thf(decl_sort1, type, int: $tType). 3.21/1.53 thf(decl_sort2, type, nat: $tType). 3.21/1.53 thf(decl_28, type, one_one_int: int). 3.21/1.53 thf(decl_31, type, plus_plus_int: int > int > int). 3.21/1.53 thf(decl_34, type, times_times_int: int > int > int). 3.21/1.53 thf(decl_37, type, zero_zero_int: int). 3.21/1.53 thf(decl_45, type, bit0: int > int). 3.21/1.53 thf(decl_46, type, bit1: int > int). 3.21/1.53 thf(decl_48, type, pls: int). 3.21/1.53 thf(decl_49, type, number_number_of_int: int > int). 3.21/1.53 thf(decl_50, type, number_number_of_nat: int > nat). 3.21/1.53 thf(decl_52, type, ord_less_int: int > int > $o). 3.21/1.53 thf(decl_55, type, ord_less_eq_int: int > int > $o). 3.21/1.53 thf(decl_58, type, power_power_int: int > nat > int). 3.21/1.53 thf(decl_75, type, m: int). 3.21/1.53 thf(decl_78, type, t: int). 3.21/1.53 thf(decl_81, type, esk2_0: int). 3.21/1.53 thf(decl_82, type, esk3_0: int). 3.21/1.53 thf(decl_99, type, esk20_0: int). 3.21/1.53 thf(decl_100, type, esk21_0: int). 3.21/1.53 thf(conj_0, conjecture, ?[X28:int, X29:int]:(((plus_plus_int @ (power_power_int @ X28 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X29 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int))), file('/export/starexec/sandbox2/tmp/tmp.bWZqYebA91/E---3.1_1425355.p', conj_0)). 3.21/1.53 thf(fact_267_one__is__num__one, axiom, ((one_one_int)=(number_number_of_int @ (bit1 @ pls))), file('/export/starexec/sandbox2/tmp/tmp.bWZqYebA91/E---3.1_1425355.p', fact_267_one__is__num__one)). 3.21/1.53 thf(fact_358_Pls__def, axiom, ((pls)=(zero_zero_int)), file('/export/starexec/sandbox2/tmp/tmp.bWZqYebA91/E---3.1_1425355.p', fact_358_Pls__def)). 3.21/1.53 thf(fact_144_number__of__is__id, axiom, ![X1543:int]:(((number_number_of_int @ X1543)=(X1543))), file('/export/starexec/sandbox2/tmp/tmp.bWZqYebA91/E---3.1_1425355.p', fact_144_number__of__is__id)). 3.21/1.53 thf(fact_132_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J, axiom, ![X937:int, X938:int]:(((plus_plus_int @ X937 @ X938)=(plus_plus_int @ X938 @ X937))), file('/export/starexec/sandbox2/tmp/tmp.bWZqYebA91/E---3.1_1425355.p', fact_132_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J)). 3.21/1.53 thf(fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06, axiom, (?[X28:int, X29:int]:(((plus_plus_int @ (power_power_int @ X28 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X29 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int)))<=(ord_less_int @ one_one_int @ t)), file('/export/starexec/sandbox2/tmp/tmp.bWZqYebA91/E---3.1_1425355.p', fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06)). 3.21/1.53 thf(fact_570_order__le__neq__implies__less, axiom, ![X624:int, X625:int]:(((((X624)!=(X625))=>(ord_less_int @ X624 @ X625))<=(ord_less_eq_int @ X624 @ X625))), file('/export/starexec/sandbox2/tmp/tmp.bWZqYebA91/E---3.1_1425355.p', fact_570_order__le__neq__implies__less)). 3.21/1.53 thf(fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06, axiom, (((t)=(one_one_int))=>?[X28:int, X29:int]:(((plus_plus_int @ (power_power_int @ X28 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X29 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int)))), file('/export/starexec/sandbox2/tmp/tmp.bWZqYebA91/E---3.1_1425355.p', fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06)). 3.21/1.53 thf(fact_0_tpos, axiom, (ord_less_eq_int @ one_one_int @ t), file('/export/starexec/sandbox2/tmp/tmp.bWZqYebA91/E---3.1_1425355.p', fact_0_tpos)). 3.21/1.53 thf(c_0_9, negated_conjecture, ~(?[X28:int, X29:int]:(((plus_plus_int @ (power_power_int @ X28 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X29 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int)))), inference(assume_negation,[status(cth)],[conj_0])). 3.21/1.53 thf(c_0_10, plain, ((one_one_int)=(number_number_of_int @ (bit1 @ pls))), inference(split_conjunct,[status(thm)],[fact_267_one__is__num__one])). 3.21/1.53 thf(c_0_11, plain, ((pls)=(zero_zero_int)), inference(split_conjunct,[status(thm)],[fact_358_Pls__def])). 3.21/1.53 thf(c_0_12, plain, ![X6648:int]:(((number_number_of_int @ X6648)=(X6648))), inference(variable_rename,[status(thm)],[fact_144_number__of__is__id])). 3.21/1.53 thf(c_0_13, negated_conjecture, ![X5075:int, X5076:int]:(((plus_plus_int @ (power_power_int @ X5075 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X5076 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))!=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])). 3.21/1.53 thf(c_0_14, plain, ((number_number_of_int @ (bit1 @ zero_zero_int))=(one_one_int)), inference(rw,[status(thm)],[c_0_10, c_0_11])). 3.21/1.53 thf(c_0_15, plain, ![X4:int]:(((number_number_of_int @ X4)=(X4))), inference(split_conjunct,[status(thm)],[c_0_12])). 3.21/1.53 thf(c_0_16, negated_conjecture, ![X4:int, X5:int]:(((plus_plus_int @ (power_power_int @ X4 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X5 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))!=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int))), inference(split_conjunct,[status(thm)],[c_0_13])). 3.21/1.53 thf(c_0_17, plain, ((one_one_int)=(bit1 @ zero_zero_int)), inference(rw,[status(thm)],[c_0_14, c_0_15])). 3.21/1.53 thf(c_0_18, plain, ![X5644:int, X5645:int]:(((plus_plus_int @ X5644 @ X5645)=(plus_plus_int @ X5645 @ X5644))), inference(variable_rename,[status(thm)],[fact_132_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J])). 3.21/1.53 thf(c_0_19, plain, ((ord_less_int @ one_one_int @ t)=>?[X28:int, X29:int]:(((plus_plus_int @ (power_power_int @ X28 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X29 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int)))), inference(fof_simplification,[status(thm)],[fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])). 3.21/1.53 thf(c_0_20, plain, ![X624:int, X625:int]:(((ord_less_eq_int @ X624 @ X625)=>(((X624)!=(X625))=>(ord_less_int @ X624 @ X625)))), inference(fof_simplification,[status(thm)],[fact_570_order__le__neq__implies__less])). 3.21/1.53 thf(c_0_21, plain, (((t)!=(one_one_int))|((plus_plus_int @ (power_power_int @ esk20_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ esk21_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])])])])). 3.21/1.53 thf(c_0_22, negated_conjecture, ![X4:int, X5:int]:(((plus_plus_int @ (power_power_int @ X4 @ (number_number_of_nat @ (bit0 @ (bit1 @ zero_zero_int)))) @ (power_power_int @ X5 @ (number_number_of_nat @ (bit0 @ (bit1 @ zero_zero_int)))))!=(plus_plus_int @ (times_times_int @ (bit0 @ (bit0 @ (bit1 @ zero_zero_int))) @ m) @ (bit1 @ zero_zero_int)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_11]), c_0_11]), c_0_11]), c_0_15]), c_0_17])). 3.21/1.53 thf(c_0_23, plain, ![X5:int, X4:int]:(((plus_plus_int @ X4 @ X5)=(plus_plus_int @ X5 @ X4))), inference(split_conjunct,[status(thm)],[c_0_18])). 3.21/1.53 thf(c_0_24, plain, (~(ord_less_int @ one_one_int @ t)|((plus_plus_int @ (power_power_int @ esk2_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ esk3_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])])). 3.21/1.53 thf(c_0_25, plain, ![X5167:int, X5168:int]:((~(ord_less_eq_int @ X5167 @ X5168)|(((X5167)=(X5168))|(ord_less_int @ X5167 @ X5168)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])). 3.21/1.53 thf(c_0_26, plain, (ord_less_eq_int @ one_one_int @ t), inference(split_conjunct,[status(thm)],[fact_0_tpos])). 3.21/1.53 thf(c_0_27, plain, (((plus_plus_int @ (power_power_int @ esk20_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ esk21_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int))|((t)!=(one_one_int))), inference(split_conjunct,[status(thm)],[c_0_21])). 3.21/1.53 thf(c_0_28, negated_conjecture, ![X4:int, X5:int]:(((plus_plus_int @ (power_power_int @ X4 @ (number_number_of_nat @ (bit0 @ (bit1 @ zero_zero_int)))) @ (power_power_int @ X5 @ (number_number_of_nat @ (bit0 @ (bit1 @ zero_zero_int)))))!=(plus_plus_int @ (bit1 @ zero_zero_int) @ (times_times_int @ (bit0 @ (bit0 @ (bit1 @ zero_zero_int))) @ m)))), inference(rw,[status(thm)],[c_0_22, c_0_23])). 3.21/1.53 thf(c_0_29, plain, (((plus_plus_int @ (power_power_int @ esk2_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ esk3_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int))|~((ord_less_int @ one_one_int @ t))), inference(split_conjunct,[status(thm)],[c_0_24])). 3.21/1.53 thf(c_0_30, plain, ![X4:int, X5:int]:((((X4)=(X5))|(ord_less_int @ X4 @ X5)|~((ord_less_eq_int @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_25])). 3.21/1.53 thf(c_0_31, plain, (ord_less_eq_int @ (bit1 @ zero_zero_int) @ t), inference(rw,[status(thm)],[c_0_26, c_0_17])). 3.21/1.53 thf(c_0_32, plain, ((t)!=(bit1 @ zero_zero_int)), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27, c_0_11]), c_0_11]), c_0_11]), c_0_15]), c_0_17]), c_0_23]), c_0_17]), c_0_28])). 3.21/1.53 thf(c_0_33, plain, ~((ord_less_int @ (bit1 @ zero_zero_int) @ t)), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29, c_0_11]), c_0_11]), c_0_11]), c_0_15]), c_0_17]), c_0_23]), c_0_17]), c_0_28])). 3.21/1.53 thf(c_0_34, plain, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_32]), c_0_33]), ['proof']). 3.21/1.53 % SZS output end CNFRefutation 3.21/1.53 % Parsed axioms : 1259 3.21/1.53 % Removed by relevancy pruning/SinE : 0 3.21/1.53 % Initial clauses : 1768 3.21/1.53 % Removed in clause preprocessing : 153 3.21/1.53 % Initial clauses in saturation : 1615 3.21/1.53 % Processed clauses : 2000 3.21/1.53 % ...of these trivial : 183 3.21/1.53 % ...subsumed : 399 3.21/1.53 % ...remaining for further processing : 1418 3.21/1.53 % Other redundant clauses eliminated : 157 3.21/1.53 % Clauses deleted for lack of memory : 0 3.21/1.53 % Backward-subsumed : 9 3.21/1.53 % Backward-rewritten : 40 3.21/1.53 % Generated clauses : 660 3.21/1.53 % ...of the previous two non-redundant : 439 3.21/1.53 % ...aggressively subsumed : 0 3.21/1.53 % Contextual simplify-reflections : 3 3.21/1.53 % Paramodulations : 510 3.21/1.53 % Factorizations : 0 3.21/1.53 % NegExts : 0 3.21/1.53 % Equation resolutions : 162 3.21/1.53 % Disequality decompositions : 0 3.21/1.53 % Total rewrite steps : 1817 3.21/1.53 % ...of those cached : 1489 3.21/1.53 % Propositional unsat checks : 0 3.21/1.53 % Propositional check models : 0 3.21/1.53 % Propositional check unsatisfiable : 0 3.21/1.53 % Propositional clauses : 0 3.21/1.53 % Propositional clauses after purity: 0 3.21/1.53 % Propositional unsat core size : 0 3.21/1.53 % Propositional preprocessing time : 0.000 3.21/1.53 % Propositional encoding time : 0.000 3.21/1.53 % Propositional solver time : 0.000 3.21/1.53 % Success case prop preproc time : 0.000 3.21/1.53 % Success case prop encoding time : 0.000 3.21/1.53 % Success case prop solver time : 0.000 3.21/1.53 % Current number of processed clauses : 220 3.21/1.53 % Positive orientable unit clauses : 86 3.21/1.53 % Positive unorientable unit clauses: 2 3.21/1.53 % Negative unit clauses : 38 3.21/1.53 % Non-unit-clauses : 94 3.21/1.53 % Current number of unprocessed clauses: 1070 3.21/1.53 % ...number of literals in the above : 2450 3.21/1.53 % Current number of archived formulas : 0 3.21/1.53 % Current number of archived clauses : 1066 3.21/1.53 % Clause-clause subsumption calls (NU) : 136089 3.21/1.53 % Rec. Clause-clause subsumption calls : 88147 3.21/1.53 % Non-unit clause-clause subsumptions : 265 3.21/1.53 % Unit Clause-clause subsumption calls : 1933 3.21/1.53 % Rewrite failures with RHS unbound : 3 3.21/1.53 % BW rewrite match attempts : 352 3.21/1.53 % BW rewrite match successes : 225 3.21/1.53 % Condensation attempts : 0 3.21/1.53 % Condensation successes : 0 3.21/1.53 % Termbank termtop insertions : 162710 3.21/1.53 % Search garbage collected termcells : 30337 3.21/1.53 3.21/1.53 % ------------------------------------------------- 3.21/1.53 % User time : 0.559 s 3.21/1.53 % System time : 0.035 s 3.21/1.53 % Total time : 0.594 s 3.21/1.53 % Maximum resident set size: 11620 pages 3.21/1.53 3.21/1.53 % ------------------------------------------------- 3.21/1.53 % User time : 1.919 s 3.21/1.53 % System time : 0.150 s 3.21/1.53 % Total time : 2.069 s 3.21/1.53 % Maximum resident set size: 7168 pages 3.21/1.53 % E exiting 3.21/1.53 EOF